Parallel computing in combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Combinatorial Parallel and Scientific Computing ∗
Combinatorial algorithms have long played a pivotal enabling role in many applications of parallel computing. Graph algorithms in particular arise in load balancing, scheduling, mapping and many other aspects of the parallelization of irregular applications. These are still active research areas, mostly due to evolving computational techniques and rapidly changing computational platforms. But t...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملParallel Genetic Algorithm in Combinatorial Optimization
Parallel genetic algorithms (PGA) use two major modiications compared to the genetic algorithm. Firstly, selection for mating is distributed. Individuals live i n a 2-D w orld. Selection of a mate is done by e a c h individual independently in its neighborhood. Secondly, each individual may improve its tness during its lifetime by e.g. local hill-climbing. The PGA is totally asynchronous, runni...
متن کاملComputing Good Allocations for Combinatorial Optimization Games
Much of the literature on cooperative games associated with combinatorial optimization problems is concerned with only one question: whether or not the core is empty. In this paper however we are concerned with the related question of finding a cost allocation whose value is as large as possible. It is well known that this amounts to solving an LP with exponentially many constraints, whose spec...
متن کاملGrid Computing Systems and Combinatorial Optimization
The goal of this paper is to study the applicability of a combinatorial optimization model in grid resource optimization. The advent of grid computing and demand for QoS guarantees call for a need of advance reservation mechanisms in order to coordinate resource sharing between autonomous partners. This term means the guarantee of providing specific resources at a specific time. The paper assum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1988
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02186483